Generalized sequences with applications to the discrete calculus
نویسندگان
چکیده
منابع مشابه
Discrete Calculus of Sequences
We showed that is possible to define a derivative and a integral of a sequence which satisfy similar proprieties of the derivative and integral of the usual differential and integral calculus. We also study convexity of sequences that can be defined as usual by the second derivative. 1 A little introduction on calculus of finite differences We will introduce some definitions and notation from t...
متن کاملGood Rough Path Sequences and Applications to Anticipating Stochastic Calculus
We consider anticipative Stratonovich stochastic differential equations driven by some stochastic process lifted to a rough path. Neither adaptedness of initial point and vector fields nor commuting conditions between vector field is assumed. Under a simple condition on the stochastic process, we show that the unique solution of the above SDE understood in the rough path sense is actually a Str...
متن کاملTHE ENTROPIES OF THE SEQUENCES OF FUZZY SETS AND THE APPLICATIONS OF ENTROPY TO CARDIOGRAPHY
In this paper, rstly we have introduced to entropy of sequences of fuzzy sets and given sometheorems about it. Secondly, the waves P and T which appears in electrocardiograms weretransferred to fuzzy sets, by using denition of entropy for sequences of fuzzy sets, and somenumerical values were obtained for sequences of waves P and T. Thus any person can makea medical predictions for some cardiac...
متن کاملA Generalized Approach to Linear Transform Approximations with Applications to the Discrete Cosine Transform
This paper aims to develop a generalized framework to systematically trade off computational complexity with output distortion in linear transforms such as the DCT, in an optimal manner. The problem is important in real-time systems where the computational resources available are time-dependent. Our approach is generic and applies to any linear transform and we use the DCT as a specific example...
متن کاملGeneralized Wong sequences and their applications to Edmonds' problems
We design two deterministic polynomial time algorithms for variants of a problem introduced by Edmonds in 1967: determine the rank of a matrix M whose entries are homogeneous linear polynomials over the integers. Given a linear subspace B of the n×n matrices over some field F, we consider the following problems: symbolic matrix rank (SMR) is the problem to determine the maximum rank among matri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1965
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1965-0179489-9